Deciding Strictly Local (SL) Languages
نویسندگان
چکیده
We have developed an efficient algorithm for determining if a Finite State Automaton describes a Strictly Local (SL) stringset, the simplest class of the Sub-Regular Hierarchy, and to determine if that stringset is a subclass of SL that is learnable by an Inductive Inference Machine. We have used this to categorize the phonotactic patterns in a catalog including essentially all of the currently attested patterns occurring in natural languages, most of which turn out to be learnable stringsets in this simplest class.
منابع مشابه
Extracting Forbidden Factors from Regular Stringsets
The work presented here continues a program of completely characterizing the constraints on the distribution of stress in human languages that are documented in the StressTyp2 database with respect to the Local and Piecewise sub-regular hierarchies. We introduce algorithms that, given a Finite-State Automaton, compute a set of forbidden words, units, initial factors, free factors and final fact...
متن کاملEvaluating Subregular Distinctions in the Complexity of Generalized Quantifiers
In order to evaluate the complexity of generalized quantifiers, we look at the string languages they can be associated to, through the lens of the subregular hierarchy. This approach shows fine-grained complexity distinctions, which we compare to those made by the semantic automata model. The cognitive reality of these predictions will be tested in an eye-tracking study. Introduction In the stu...
متن کاملTier-based Strictly Local Constraints for Phonology
Beginning with Goldsmith (1976), the phonological tier has a long history in phonological theory to describe non-local phenomena. This paper defines a class of formal languages, the Tier-based Strictly Local languages, which describe such phenomena and locates them within the Subregular Hierarchy (McNaughton and Papert, 1971). In particular, these languages contain the Strictly Local languages,...
متن کاملSubregular Complexity and Deep Learning
This paper presents experiments illustrating how formal language theory can shed light on deep learning. We train naive Long Short-Term Memory (LSTM) Recurrent Neural Networks (RNNs) on six formal languages drawn from the Strictly Local (SL) and Strictly Piecewise (SP) classes. These classes are relevant to computational linguistics and among the simplest in a mathematically well-understood hie...
متن کاملTier-based Strictly Local Constraints for Phonology
Beginning with Goldsmith (1976), the phonological tier has a long history in phonological theory to describe non-local phenomena. This paper defines a class of formal languages, the Tier-based Strictly Local languages, which begin to describe such phenomena. Then this class is located within the Subregular Hierarchy (McNaughton and Papert, 1971). It is found that these languages contain the Str...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008